منابع مشابه
Complexity, decidability and completeness
We give resource bounded versions of the Completeness Theorem for propositional and predicate logic. For example, it is well known that every computable consistent propositional theory has a computable complete consistent extension. We show that, when length is measured relative to the binary representation of natural numbers and formulas, every polynomial time decidable propositional theory ha...
متن کاملKleene Algebra with Tests: Completeness and Decidability
Kleene algebras with tests provide a rigorous framework for equational speci cation and veri cation They have been used success fully in basic safety analysis source to source program transformation and concurrency control We prove the completeness of the equational theory of Kleene algebra with tests and continuous Kleene algebra with tests over language theoretic and relational models We also...
متن کاملCompleteness and Decidability in Sequence Logic
Sequence logic is a parameterized logic where the formulas are sequences of formulas of some arbitrary underlying logic. The sequence formulas are interpreted in certain linearly ordered sets of models of the underlying logic. This interpretation induces an entailment relation between sequence formulas which strongly depends on which orderings one wishes to consider. Some important classes are:...
متن کاملExpressive Power and Decidability for Memory Logics
Taking as inspiration the hybrid logic HL(↓), we introduce a new family of logics that we call memory logics. In this article we present in detail two interesting members of this family defining their formal syntax and semantics. We then introduce a proper notion of bisimulation and investigate their expressive power (in comparison with modal and hybrid logics). We will prove that in terms of e...
متن کاملExpressive Completeness of Duration Calculus
This paper compares the expressive power of first-order monadic logic of order, a fundamental formalism in mathematical logic and the theory of computation, with that of the Propositional version of Duration Calculus (PDC), a formalism for the specification of realtime systems. Our results show that the propositional duration calculus is expressively complete for first-order monadic logic of or...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1990
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1093635592